A Polynomial Complexity Optimal Multiuser Detection Algorithm Based on Monotonicity Properties
نویسندگان
چکیده
منابع مشابه
Direct proof of polynomial complexity optimum multiuser detection algorithm - Electronics Letters
TAKATSUKASA, K.: ‘A binary sequence pair with half period zero correlation zone’. Tech. Rpt. of IEICE, March 1999, IT 98-89, pp. 31-34 FAN, P.Z., SUEHIRO, N., KUROYANAGl, N . , and DENG, X.M.: ‘A Class Of binary sequences with zero correlation zone’, Electron. Lett.. 1999, 35, pp. 111-179 4 DENG.X.M., and FAN,P.Z.: ‘Spreading sequence sets with zero correlation zone’, Electron. Lett., 2000, 36,...
متن کاملA CDMA multiuser detection algorithm based on survey propagation
Code division multiple access (CDMA) is a core technology of today’s wireless communication system that employs data transmission between multiple terminals and a single base station. In the general scenario of a CDMA system, the binary signals of multiple users are modulated by spreading codes assigned to each user, and these modulated sequences are transmitted to a base station. The base stat...
متن کاملOptimal Multiuser Detection with Artificial Fish Swarm Algorithm
The optimal multiuser detection for communication systems can be characterized as an NP-hard optimization problem. In this paper, as a new heuristic intelligent optimization algorithm, Artificial Fish Swarm Algorithm (AFSA) is employed for the detection problem, the results show that it has better performances such as good global convergence, strong robustness, insensitive to initial values, si...
متن کاملCovariance Analysis of a vector tracking GPS receiver based on MMSE multiuser Detection
In high dynamic conditions, using vector tracking loops instead of scalar tracking loops in GPS receivers is proved as an efficient method to compensate the performance. The Minimum Mean Squared Error detector as a multiuser detector is applied in the vector tracking loop for more reliability and efficiency. The Kalman filter does the two tasks of tracking and extracting the navigation data aft...
متن کاملPolynomial complexity optimal detection of certain multiple-access systems
It is demonstrated that optimal multiple user detection in a linear multiple access system with identical cross-correlations requires only O (K logK) operations instead of the worst case O ( 2 ) . A simple optimal detection algorithm is given, which when generalized has complexity that is exponential not in the number of users, but in the number of unique cross-correlation values.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETRI Journal
سال: 2010
ISSN: 1225-6463
DOI: 10.4218/etrij.10.0209.0503